Functional Equations for Lexicographic Products *

نویسنده

  • Saharon Shelah
چکیده

We generalize the main result of [K–K–S] concerning the convex embeddings of a chain Γ in a lexicographic power ∆Γ. For a fixed non-empty chain ∆, we derive necessary and sufficient conditions for the existence of non-empty solutions Γ to each of the lexicographic functional equations (∆) ≃ Γ , (∆) ≃ Γ and (∆) ≃ Γ .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Functorial Equations for Lexicographic Products

We generalize the main result of [K–K–S] concerning the convex embeddings of a chain Γ in a lexicographic power ∆Γ. For a fixed non-empty chain ∆, we derive necessary and sufficient conditions for the existence of non-empty solutions Γ to each of the lexicographic functorial equations (∆) ' Γ , (∆) ' Γ and (∆) ' Γ .

متن کامل

On Lexicographic Products of Two Fuzzy Graphs

Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-product and lexicographic max-product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected, effective and complete properties of the operations lexicographic products a...

متن کامل

Counting and Gröbner Bases

Gröbner bases were introduced by Buchberger (1965) and are now firmly established as a tool in Commutative Algebra and other areas. The reader is referred to Buchberger (1985), Cox, Little and O’Shea (1992) or Becker and Weispfenning (1993) for more information. Eisenbud (1995) places Gröbner bases within the context of more advanced Commutative Algebra. The ingredients for a Gröbner basis are ...

متن کامل

Axiomatizing the lexicographic products of modal logics with linear temporal logic

Given modal logics 1, 2, their lexicographic product 1 ⇤ 2 is a new logic whose frames are the Cartesian products of a 1-frame and a 2-frame, but with the new accessibility relations reminiscent of a lexicographic ordering. This article considers the lexicographic products of several modal logics with linear temporal logic (LTL) based on “next” and “always in the future”. We provide axiomatizat...

متن کامل

On the Zagreb and Eccentricity Coindices of Graph Products

The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008